Declining neighborhood simulated annealing algorithm to robust fixture synthesis in a point-set domain

A new Simulated Annealing algorithm for the robust coloring problem

The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...

Neighborhood Size in the Simulated Annealing Algorithm

Simulated annealing is a probabilistic algorithm that has shown some promise when applied to combinatorially NP-hard problems. One advantage of the simulated annealing algorithm is that it is based on an analogy with statistical mechanics which is not problem-specific. However, any implementation of the algorithm for a given problem requires that several specific choices be made. The success or...

a new simulated annealing algorithm for the robust coloring problem

the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...

Optimizing fixture layout in a point-set domain

This paper describes an approach to optimal design of a fixture layout with the minimum required number of elements, i.e., six locators and a clamp. The approach applies to parts with arbitrary 3-D geometry and is restricted to be within a discrete domain of locations for placing the fixture elements of nonfrictional contacts. The paper addresses two major issues in the fixture layout design: 1...

Neighborhood Parallel Simulated Annealing